Primitive Recursive Decidability for Large Rings of Algebraic Integers
نویسنده
چکیده
منابع مشابه
Deciding DPDA Equivalence Is Primitive Recursive
Recently Sénizergues showed decidability of the equivalence problem for deterministic pushown automata. The proof of decidability is two semi-decision procedures that do not give a complexity upper bound for the problem. Here we show that there is a simpler deterministic decision procedure that has a primitive recursive upper bound.
متن کاملPrimitive recursive functions versus partial recursive functions: comparing the degree of undecidability
Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial recursive or a primitive recursive function. A similar situation happens for results like Rice Theorem (which is false for primitive recursive functions). Classical...
متن کاملNon-primitive recursive decidability of products of modal logics with expanding domains
We show that—unlike products of ‘transitive’ modal logics which are usually undecidable— their ‘expanding domain’ relativisations can be decidable, though not in primitive recursive time. In particular, we prove the decidability and the finite expanding product model property of bimodal logics interpreted in two-dimensional structures where one component—call it the ‘flow of time’—is • a finite...
متن کاملElliptic Curves Retaining Their Rank in Finite Extensions and Hilbert’s Tenth Problem for Rings of Algebraic Numbers
Using Poonen’s version of “weak vertical method” we produce new examples of “large” and “small” rings of algebraic numbers (including rings of integers) where Z and/or the ring of integers of a subfield are existentially definable and/or where the ring version of Mazur’s conjecture on topology of rational points does not hold.
متن کاملDefining Integrality at Prime Sets of High Density in Number Fields
1. Introduction. Interest in the questions of Diophantine definability and decid-ability goes back to a question that was posed by Hilbert: Given an arbitrary polynomial equation in several variables over Z, is there a uniform algorithm to determine whether such an equation has solutions in Z? This question, otherwise known as Hilbert's tenth problem, has been answered negatively in the work of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007